Transmission Network Expansion Planning Considering Wind Power and Load Uncertainties Based on Multi-Agent DDQN

نویسندگان

چکیده

This paper presents a multi-agent Double Deep Q Network (DDQN) based on deep reinforcement learning for solving the transmission network expansion planning (TNEP) of high-penetration renewable energy source (RES) system considering uncertainty. First, K-means algorithm that enhances extraction quality variable wind and load power uncertain characteristics is proposed. Its clustering objective function considers cumulation change rate operation data. Then, typical scenarios, we build bi-level TNEP model includes comprehensive cost, electrical betweenness, curtailment shedding to evaluate stability economy network. Finally, propose DDQN predicts construction value each line through interaction with model, then optimizes sequence. training mechanism more traceable interpretable than heuristic-based methods. Simultaneously, experience reuse characteristic can be implemented in multi-scenario tasks without repeated training. Simulation results obtained modified IEEE 24-bus New England 39-bus verify effectiveness proposed method.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Return on Investment in Transmission Network Expansion Planning Considering Wind Generation Uncertainties Applying Non-dominated Sorting Genetic Algorithm

Although significant private investment is absorbed in different sectors of power systems, transmission sector is still suffering from appropriate private investment. This is because of the pricing policies of transmission services, tariffs, and especially for investment risks. Investment risks are due to the uncertain behaviour of power systems that discourage investors to invest in the transm...

متن کامل

DCGA Based-Transmission Network Expansion Planning Considering Network Adequacy

Transmission network expansion planning (TNEP) is an important component of power system planning that its task is to minimize the network construction and operational cost while satisfying the demand increasing, imposed technical and economic conditions. Up till now, various methods have been presented to solve the static transmission network expansion planning (STNEP) problem. But in all of t...

متن کامل

Transmission Network Expansion Planning Considering Uncertainties in Loads and Renewable Energy Resources

This paper proposes a novel method for transmission network expansion planning (TNEP) that take into account uncertainties in loads and renewable energy resources. The goal of TNEP is to minimize the expansion cost of candidate lines without any load curtailment. A robust linear optimization algorithm is adopted to minimize the load curtailment with uncertainties considered under feasible expan...

متن کامل

Transmission expansion planning based on merchandizing surplus of transmission lines

This paper proposes an optimal transmission expansion planning (TEP) which is based on determining share of each line in merchandizing surplus (MS) of system, determining by Independent System Operator (ISO). The more share of a line in MS of system denotes the priority of a line for expansion. The procedure of determining MS of each line in a power system is based on determining the MS share o...

متن کامل

A Probabilistic Approach to Transmission Expansion Planning in Deregulated Power Systems under Uncertainties

Restructuring of power system has faced this industry with numerous uncertainties. As a result, transmission expansion planning (TEP) like many other problems has become a very challenging problem in such systems. Due to these changes, various approaches have been proposed for TEP in the new environment. In this paper a new algorithm for TEP is presented. The method is based on probabilisti...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Energies

سال: 2021

ISSN: ['1996-1073']

DOI: https://doi.org/10.3390/en14196073